An Adaptive Parsing Technique for ProRules Grammar

نویسندگان

  • Sri Fatimah Tjong
  • Nasreddine Hallam
  • Michael Hartley
چکیده

This paper discusses the proposed technique for analysis and production of English grammar rules by using the structure and meaning of human language. We come up with ProRules grammar that is based on grammar adaptation and compilation. ProRules serves as a basis scheme in processing the natural language requirements specifications. This paper will further outline the ideal algorithms for lexical scanning and parsing of the natural language requirements specifications. Since ProRules is designed to eliminate the occurrence of left recursion, an adaptive recursive descent parsing strategy is chosen to build the Parser. Therefore, to show the applicability and adaptability of our algorithms, we come out with Scanner and Parser prototypes system. We also apply some heuristic strategies in our parsing strategy to deal with lower level of natural language ambiguity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient CCG Parsing: A* versus Adaptive Supertagging

We present a systematic comparison and combination of two orthogonal techniques for efficient parsing of Combinatory Categorial Grammar (CCG). First we consider adaptive supertagging, a widely used approximate search technique that prunes most lexical categories from the parser’s search space using a separate sequence model. Next we consider several variants on A*, a classic exact search techni...

متن کامل

Broad-coverage CCG Semantic Parsing with AMR

We propose a grammar induction technique for AMR semantic parsing. While previous grammar induction techniques were designed to re-learn a new parser for each target application, the recently annotated AMR Bank provides a unique opportunity to induce a single model for understanding broad-coverage newswire text and support a wide range of applications. We present a new model that combines CCG p...

متن کامل

Incremental Parsing, Or Incremental Grammar?

Standard grammar formalisms are defined without reflection of the incremental and serial nature of language processing, and incrementality must therefore be reflected by independently defined parsing and/or generation techniques. We argue that this leads to a poor setup for modelling dialogue, with its rich speaker-hearer interaction, and instead propose context-based parsing and generation mod...

متن کامل

Transition and Parsing State and Incrementality in Dynamic Syntax

This paper presents an implementation of a gramar of Dynamic Syntax for Japanese. Dynamic Syntax is a grammar formalism which enables a parser to process a sentence in an incremental fashion, establishing the semantic representation. Currently the application of lexical rules and transition rules in Dynamic Syntax is carried out arbitrarily and this leads to inefficient parsing. This paper prov...

متن کامل

UofR at SemEval-2016 Task 8: Learning Synchronous Hyperedge Replacement Grammar for AMR Parsing

In this paper, we apply a synchronous-graphgrammar-based approach to SemEval-2016 Task 8, Meaning Representation Parsing. In particular, we learn Synchronous Hyperedge Replacement Grammar (SHRG) rules from aligned pairs of sentences and AMR graphs. Then we use Earley algorithm with cubepruning for AMR parsing given new sentences and the learned SHRG. Experiments on the evaluation dataset demons...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006